Maximizing Several Cuts Simultaneously
نویسندگان
چکیده
منابع مشابه
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we have eGi(A,B) ≥ mi/2 − √ mi. This answers a question of Bollobás and Scott. We also prove results about partitions into more than two vertex classes.
متن کاملMinimizing breaks by maximizing cuts
We propose to solve the break minimization problem in sports scheduling by transforming it into a maximum cut problem in an undirected graph and applying a branch-and-cut algorithm. Our approach outperforms previous approaches with constraint programming and integer programming techniques.
متن کاملNonlinear Robust Identification with −GA: FPS Under Several Norms Simultaneously
In nonlinear robust identification context, a process model is represented by a nominal model and possible deviations. With parametric models this process model can be expressed as the so-called Feasible Parameter Set (FPS), which derives from the minimization of identification error specific norms. In this work, several norms are used simultaneously to obtain the FPS. This fact improves the mo...
متن کاملOn the existence of edge cuts leaving several large components
We characterize graphs of large enough order or large enough minimum degree which contain edge cuts whose deletion results in a graph with a specified number of large components. This generalizes and extends recent results due to Ou (Edge cuts leaving components of order at least m, Discrete Math. 305 (2005), 365-371) and Zhang and Yuan (A proof of an inequality concerning k-restricted edge con...
متن کاملSeveral notes on the power of Gomory-Chvatal cuts
We prove that the Cutting Plane proof system based on Gomory–Chvátal cuts polynomially simulates the lift-and-project system with integer coefficients written in unary. The restriction on the coefficients can be omitted when using Krajı́ček’s cut-free Gentzenstyle extension of both systems. We also prove that Tseitin tautologies have short proofs in this extension (of any of these systems and wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2006
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548306007863